Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups
نویسندگان
چکیده
A quantum algorithm for the Hidden Subgroup Problem over the group Z/pZ o Z/qZ is presented. This algorithm, which for certain parameters of the group qualifies as ‘efficient’, generalizes prior work on related semi-direct product groups. 1998 ACM Subject Classification F.1.2 Modes of Computation, F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Efficient Quantum Algorithms for the Hidden Subgroup Problem over a Class of Semi-direct Product Groups
In this paper, we consider the hidden subgroup problem (HSP) over the class of semi-direct product groups Zpr ⋊ Zq, for p and q prime. We first present a classification of these groups in five classes. Then, we describe a polynomial-time quantum algorithm solving the HSP over all the groups of one of these classes: the groups of the form Zpr ⋊ Zp, where p is an odd prime. Our algorithm works ev...
متن کاملAn Efficient Algorithm for the Hidden Subgroup Problem over a Class of Semi-direct Product Groups
In this paper, we consider the hidden subgroup problem (HSP) over the class of semi-direct product groups Zn⋊Zq. The definition of the semi-direct product depending on the choice of an homomorphism, we first analyze the different possibilities for this homomorphism in function of n and q. Then, we present a polynomial-time quantum algorithm for the case Zpr ⋊ Zp when p is an odd prime.
متن کاملAn Efficient Quantum Algorithm for the Hidden Subgroup Problem over a Class of Semi-direct Product Groups
In this paper, we consider the hidden subgroup problem (HSP) over the class of semi-direct product groups Zn ⋊ Zq. The definition of the semi-direct product depending on the choice of an homomorphism, we first analyze the different possibilities for this homomorphism in function of n and q. Then, we present a polynomial-time quantum algorithm solving the HSP over the groups of the form Zpr ⋊ Zp...
متن کاملua nt - p h / 02 01 09 5 v 1 2 2 Ja n 20 02 QUANTUM HIDDEN SUBGROUP ALGORITHMS : A MATHEMATICAL PERSPECTIVE
The ultimate objective of this paper is to create a stepping stone to the development of new quantum algorithms. The strategy chosen is to begin by focusing on the class of abelian quantum hidden subgroup algorithms, i.e., the class of abelian algorithms of the Shor/Simon genre. Our strategy is to make this class of algorithms as mathematically transparent as possible. By the phrase “mathematic...
متن کاملua nt - p h / 02 01 09 5 v 2 1 7 Fe b 20 02 QUANTUM HIDDEN SUBGROUP ALGORITHMS : A MATHEMATICAL PERSPECTIVE SAMUEL
The ultimate objective of this paper is to create a stepping stone to the development of new quantum algorithms. The strategy chosen is to begin by focusing on the class of abelian quantum hidden subgroup algorithms, i.e., the class of abelian algorithms of the Shor/Simon genre. Our strategy is to make this class of algorithms as mathematically transparent as possible. By the phrase “mathematic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014